package hotLeetcode;

public class H70Leetcode {
    public    int climbStairs1(int n) {

        if (n <= 2) {
            return n;
        }
        int[] dp = new int[n + 1];
        dp[1] = 1;
        dp[2] = 2;

        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }

        return dp[n];

    }


    public static int climbStairs(int n) {
        if (n <= 2) {
            return n;
        }
        return climbStairs(n - 1) + climbStairs(n - 2);
    }




    public static void main(String[] args) {
        System.out.println(H70Leetcode.climbStairs(5));
    }



}
